An Overview of Elliptic Curve Primality Proving
نویسنده
چکیده
Primes are of fundamental importance in number theory, and primality testing is one of the oldest problems in mathematics. Various algorithms have been presented over the past two millenia, ever since Eratosthenes detailed his eponymous sieve in 274 B.C. After important theoretical advances by Fermat, Euler, Legendre, and Gauss in the seventeeth and eighteenth centuries, the rise of computational approaches to primality testing began in the 1970’s.
منابع مشابه
Cyclotomy Primality Proving
Two rational primes p, q are called dual elliptic if there is an elliptic curve E mod p with q points. They were introduced as an interesting means for combining the strengths of the elliptic curve and cyclotomy primality proving algorithms. By extending to elliptic curves some notions of galois theory of rings used in the cyclotomy primality tests, one obtains a new algorithm which has heurist...
متن کاملImplementing the Asymptotically Fast Version of the Elliptic Curve Primality Proving Algorithm Less Prelimimary Version 040825
The elliptic curve primality proving algorithm is one of the fastest practical algorithms for proving the primality of large numbers. Its running time cannot be proven rigorously, but heuristic arguments show that it should run in time Õ((logN)) to prove the primality of N . An asymptotically fast version of it, attributed to J. O. Shallit, runs in time Õ((logN)). The aim of this article is to ...
متن کاملImplementing the asymptotically fast version of the elliptic curve primality proving algorithm
The elliptic curve primality proving (ECPP) algorithm is one of the current fastest practical algorithms for proving the primality of large numbers. Its running time currently cannot be proven rigorously, but heuristic arguments show that it should run in time Õ((logN)5) to prove the primality of N . An asymptotically fast version of it, attributed to J. O. Shallit, is expected to run in time Õ...
متن کاملDistributed Primality Proving and the Primality of (23539+1)/3
We explain how the Elliptic Curve Primality Proving algorithm can be implemented in a distributed way. Applications are given to the certiication of large primes (more than 500 digits). As a result, we describe the successful attempt at proving the primality of the 1065-digit (2 3539 +1)=3, the rst ordinary Titanic prime.
متن کاملPrimality Proving via One round in Ecpp and One Iteration
On August 2002, Agrawal, Kayal and Saxena announced the first deterministic and polynomial time primality testing algorithm. For an input n, the AKS algorithm runs in heuristic time Õ(log n). Verification takes roughly the same amount of time. On the other hand, the Elliptic Curve Primality Proving algorithm (ECPP) runs in random heuristic time Õ(log n) ( Õ(log n) if the fast multiplication is ...
متن کامل